Slightly Superexponential Parameterized Problems
نویسندگان
چکیده
منابع مشابه
Parameterized Graph Cleaning Problems
We investigate the Induced Subgraph Isomorphism problem with non-standard parametrization, where the parameter is the difference |V (G)| − |V (H)| with H and G being the smaller and the larger input graph, respectively. Intuitively, we can interpret this problem as “cleaning” the graph G, regarded as a pattern containing extra vertices indicating errors, in order to obtain the graph H represent...
متن کاملParameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k vertices such that (a) each of the given ` terminals is separated from the others, (b) each of the given ` pairs of terminals are separated, (c) exactly ` vertices are cut away from the graph, (d) exactly ` connected vert...
متن کاملParameterized Counting Problems
Parameterized complexity has so far been largely con ned to consideration of computational problems as decision or search prob lems However it is becoming evident that the parameterized point of view can lead to new insight into counting problems The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems
متن کاملParameterized Approximation Problems
Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis. Up until now, most of the work in the area has focussed on exact algorithms for decision problems. The goal of the present paper is to apply parameterized ideas to approximation. We begin exploration of parameterized approximation problems, where the problem in question ...
متن کاملSparse Parameterized Problems
Sparse languages play an important role in classical structural complexity theory. In this paper we introduce a natural definition of sparse problems for parameterized complexity theory. We prove an analog of Mahaney’s theorem: there is no sparse parameterized problem which is hard for the tth level of the W hierarchy, unless the W hierarchy itself collapses up to level t. The main result is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/16m1104834